An elastic partial shape matching technique

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An elastic partial shape matching technique

We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that best matches a query. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a directed acyclic graph (DAG). The approach allows us to compute the optimal scal...

متن کامل

An Optimization Method for Elastic Shape Matching

This note addresses the following shape matching problem: given a ‘template’ shape, numerically described by means of a computational mesh, and a ‘target’ shape, known only via a signed distance function to its boundary, we aim at deforming iteratively the mesh of the template shape into a computational mesh of the target shape. To achieve this goal, we rely on techniques from shape optimizatio...

متن کامل

Shape Matching by Elastic Deformation

In this paper we present a new one-dimensional shape matching technique based on elastic deformation of a model or template. Deformations of the given template are introduced as a way to improve the matching with the image data. A trade-o is made between the amount of deformation and a gure of merit that accounts for the match. This approach yields a new optimization functional so that the opti...

متن کامل

Dense Elastic 3D Shape Matching

We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes X and Y by means of a convex relaxation. Rather than mapping points to points we match infinitesimal surface patches while preserving the geometric structures. In this spirit, we consider matchings between objects’ surfaces as diffeomorphisms which are by definition geometricall...

متن کامل

Fully Spectral Partial Shape Matching

We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain. Our technique relies on the recently introduced partial functional maps formalism and on the joint approximate diagonalization (JAD) of the Laplace-Beltrami operators previously introduced for matching non-isometric shapes. We show that a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition

سال: 2007

ISSN: 0031-3203

DOI: 10.1016/j.patcog.2007.03.004